#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N=2e5+2,mod=998244353;
int T,n,s,k,b,a[N],inv[N],ans;
void solve(){
scanf("%lld",&n);b=n*(n-1ll)/2%mod,s=k=ans=0;
for (int i = 1; i <=n ; ++i) scanf("%lld",&a[i]),s+=a[i];
for (int i = 1; i <=n-s ; ++i) k+=a[i];
for (int i = k; i ; i--) ans=(ans+b*inv[i]%mod*inv[i])%mod;
printf("%lld\n",ans);
}
signed main(){
inv[1]=1;
for(int i=2;i<N;++i) inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod;
scanf("%lld",&T);
while (T--){
solve();
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |